Intersection Graphs of Pseudosegments: Chordal Graphs
نویسندگان
چکیده
منابع مشابه
Intersection Graphs of Pseudosegments: Chordal Graphs
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that can be represented as intersection graph of subpaths on a tree are pseudosegment intersection graphs. We then study the limits of representability. We describe a family of intersection graphs of substars of a star which ...
متن کاملChordal Graphs as Intersection Graphs of Pseudosegments
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. The main contribution is a construction which shows that all chordal graphs which have a representation as intersection graph of subpaths on a tree are representable. A family of intersection graphs of substars of a star is used to show that not all chordal graphs are representable by pseudosegme...
متن کاملIntersection models of weakly chordal graphs
We first present new structural properties of a two-pair in various graphs. A twopair is used in a well-known characterization of weakly chordal graphs. Based on these properties, we prove the main theorem: a graph G is a weakly chordal (K2,3, 4P2, P2 ∪ P4, P6,H1,H2,H3)-free graph if and only if G is an edge intersection graph of subtrees on a tree with maximum degree 4. This characterizes the ...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملChordal Graphs
One can prove the following propositions: (1) For every non zero natural number n holds n − 1 is a natural number and 1 ≤ n. (2) For every odd natural number n holds n − 1 is a natural number and 1 ≤ n. (3) For all odd integers n, m such that n < m holds n ≤ m − 2. (4) For all odd integers n, m such that m < n holds m + 2 ≤ n. (5) For every odd natural number n such that 1 6= n there exists an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2010
ISSN: 1526-1719
DOI: 10.7155/jgaa.00204